Euclidean Pawel Winter 187 trees visibility
نویسنده
چکیده
The notion of Steiner visibility graphs is introduced. Their applicability in connection with the construction of good quality suboptimal solutions to the Euclidean Steiner tree problem with obstacles is discussed. Polynomial algorithms generating Steiner visibility graphs are described.
منابع مشابه
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees
We suggest a novel distance-based method for the determination of phylogenetic trees. It is based on multidimensional scaling and Euclidean Steiner trees in high-dimensional spaces. Preliminary computational experience shows that the use of Euclidean Steiner trees for finding phylogenetic trees is a viable approach. Experiments also indicate that the new method is comparable with results produc...
متن کاملObstacle - Avoiding Euclidean
The rst exact algorithm for the obstacle-avoiding Euclidean Steiner tree problem in the plane (in its most general form) is presented. The algorithm uses a two-phase framework | based on the generation and concatenation of full Steiner trees | previously shown to be very successful for the obstacle-free case. Computational results for moderate size problem instances are given; instances with up...
متن کاملSteiner Minimal Trees in Simple Polygons
An O(n log n) time and O(n) space algorithm for the Euclidean Steiner tree problem with four terminals in a simple polygon with n vertices is given. Its applicability to the problem of determining good quality solutions for any number of terminals is discussed.
متن کاملBottleneck Distances and Steiner Trees in the Euclidean d-Space
Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-dimensional space, d ≥ 2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain low cost trees spanning all terminals. The weakness of this approach is that o...
متن کاملShort trees in polygons
We consider the problem of determining the shortest Euclidean tree for terminals in a simple polygon. We give a fast polynomial heuristic based on greedy concatenation of Euclidean Steiner minimal trees with up to four terminals. Computational results indicate that the solutions obtained are close to optimal solutions. Another important contribution of the paper are linear time algorithms for o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001